Intrinsic metrics in polygonal domains
نویسندگان
چکیده
We study inequalities between the hyperbolic metric and intrinsic metrics in convex polygonal domains complex plane. A special attention is paid to triangular ratio rectangles. local leads investigation of relationship conformal radius at an arbitrary point a planar domain distance boundary.
منابع مشابه
Homogenization in polygonal domains
We consider the homogenization of elliptic systems with ε-periodic coefficients. Classical two-scale approximation yields a O(ε) error inside the domain. We discuss here the existence of higher order corrections, in the case of general polygonal domains. The corrector depends in a non-trivial way on the boundary. Our analysis extends substantially previous results obtained for polygonal domains...
متن کاملRouting in Polygonal Domains
We consider the problem of routing a data packet through the visibility graph of a polygonal domain P with n vertices and h holes. We may preprocess P to obtain a label and a routing table for each vertex. Then, we must be able to route a data packet between any two vertices p and q of P , where each step must use only the label of the target node q and the routing table of the current node. Fo...
متن کاملQuickest Visibility Queries in Polygonal Domains
Let s be a point in a polygonal domain P of h−1 holes and n vertices. We consider the following quickest visibility query problem. Given a query point q in P, the goal is to find a shortest path in P to move from s to see q as quickly as possible. Previously, Arkin et al. (SoCG 2015) built a data structure of size O(n22α(n) logn) that can answer each query in O(K log2 n) time, where α(n) is the...
متن کاملDiscrete Surveillance Tours in Polygonal Domains
The watchman route of a polygon is a closed tour that sees all points of the polygon. Computing the shortest such tour is a well-studied problem. Another reasonable optimization criterion is to require that the tour minimizes the hiding time of the points in the polygon, i.e., the maximum time during which any points is not seen by the agent following the tour at unit speed. We call such tours ...
متن کاملOn the Geodesic Diameter in Polygonal Domains∗
A polygonal domain P with n corners V and h holes is a connected polygonal region of genus h whose boundary consists of h + 1 closed chains of n total line segments. The holes and the outer boundary of P are regarded as obstacles. Then, the geodesic distance d(p, q) between any two points p, q in polygonal domain P is defined to be the (Euclidean) length of a shortest obstacle-avoiding path bet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Nachrichten
سال: 2023
ISSN: ['1522-2616', '0025-584X']
DOI: https://doi.org/10.1002/mana.202200242